In This Issue: Trade-Offs, Time Use, Depression Care
نویسندگان
چکیده
منابع مشابه
Time-Space Trade-offs in Population Protocols
Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as ...
متن کاملTime-Space Trade-offs in Molecular Computation
Population protocols are a popular model of distributed computing, in which randomly-interacting agents with little computational power cooperate to jointly perform computational tasks. Inspired by developments in molecular computation, and in particular DNA computing, recent algorithmic work has focused on the complexity of solving simple yet fundamental tasks in the population model, such as ...
متن کاملTime and Cost Trade-Offs in Gossiping
Each of n processors has a value which should be transmitted to all other processors. This fundamental communication task is called gossiping. In a unit of time every processor can communicate with at most one other processor and during such a transmission each member of a communicating pair learns all values currently known to the other. Two important criteria of efficiency of a gossiping algo...
متن کاملIn This Issue of Diabetes Care
In this issue of Diabetes Care (p. 2271), Stark Casagrande et al. examined four waves of data from the National Health and Nutrition Examination Survey to assess progress in meeting the ABC goals. These goals, which are a key aspect of the National Diabetes Education Program, include clinical recommendations for diabetic individuals related to control of A1C, blood pressure, and LDL cholesterol...
متن کاملTime-space Trade-offs for Voronoi Diagrams
Let S be a planar n-point set. Classically, one can find the Voronoi diagram VD(S) for S in O(n log n) time and O(n) space. We study the situation when the available workspace is limited: for s ∈ {1, . . . , n}, an s-workspace algorithm has read-only access to an input array with the points from S in arbitrary order, and it may use only O(s) additional words of Θ(log n) bits for reading and wri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Family Medicine
سال: 2005
ISSN: 1544-1709,1544-1717
DOI: 10.1370/afm.415